Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Improvement on DV-Hop localization algorithm in wireless sensor networks
XIA Shaobo, ZOU Jianmei, ZHU Xiaoli, LIAN Lijun
Journal of Computer Applications    2015, 35 (2): 340-344.   DOI: 10.11772/j.issn.1001-9081.2015.02.0340
Abstract525)      PDF (798KB)(557)       Save

DV-Hop localization algorithm uses the hop count multiplied by the average distance per hop to estimate the distance between nodes. Under the condition of not changing the step of the original DV-Hop algorithm and not needing an additional hardware, the traditional DV-Hop algorithm was improved from two aspects to solve the problem of the large error in the localization. On the one hand, the hop count between the nodes based on the communication radius was corrected. On the other hand, with the help of the deviation between the actual distance and the estimated distance of the beacon nodes, the average hop distance per hop was corrected. In the same network environment, the positioning error of the proposed algorithm was effectively reduced by about 15% compared with the original DV-Hop algorithm, as well as reduced by 5%-7% compared with another improved algorithm which also used the ideal estimated hop count value between the beacon nodes to correct the actual value between them.The experimental results show that the proposed algorithm can effectively reduce the distance estimation error between nodes and improve the positioning accuracy.

Reference | Related Articles | Metrics
Improvement of DV-Hop based localization algorithm
XIA Shaobo LIAN Lijun WANG Luna ZHU Xiaoli ZOU Jianmei
Journal of Computer Applications    2014, 34 (5): 1247-1250.   DOI: 10.11772/j.issn.1001-9081.2014.05.1247
Abstract467)      PDF (614KB)(384)       Save

DV-Hop algorithm uses the hop number multiplied by the average distance per hop to estimate the distance between nodes and the trilateral measurement or the maximum likelihood to estimate the node coordinate information, which has defects and then causing too many positioning errors. This paper presented an improved DV-Hop algorithm based on node density regional division (Density Zoning DV-Hop, DZDV-Hop), which used the connectivity of network and the node density to limit the hop number of the estimated node coordinate information and the weighted centroid method to estimate the positioning coordinates. Compared with the traditional DV-Hop algorithm in the same network hardware and topology environment, the result of Matlab simulation test shows that, the communication amount of nodes can be effectively reduced and the positioning error rate can be reduced by 13.6% by using the improved algorithm, which can improve the positioning accuracy.

Reference | Related Articles | Metrics